A robust prolongation operator for non-nested finite element methods
نویسندگان
چکیده
منابع مشابه
Finite Element Methods for Convection Diffusion Equation
This paper deals with the finite element solution of the convection diffusion equation in one and two dimensions. Two main techniques are adopted and compared. The first one includes Petrov-Galerkin based on Lagrangian tensor product elements in conjunction with streamlined upwinding. The second approach represents Bubnov/Petrov-Galerkin schemes based on a new group of exponential elements. It ...
متن کاملNested Newton Strategies for Energy-Corrected Finite Element Methods
Energy-corrected finite element methods provide an attractive technique to deal with elliptic problems in domains with re-entrant corners. Optimal convergence rates in weighted L2-norms can be fully recovered by a local modification of the stiffness matrix at the re-entrant corner, and no pollution effect occurs. Although the existence of optimal correction factors is established, it remains op...
متن کاملRobust finite element methods for Biot’s consolidation model
We propose new locking-free finite element methods for Biot’s consolidation model by coupling nonconforming and mixed finite elements. We show a priori error estimates of semidiscrete and fully discrete solutions. The main advantage of our method is that a uniform-in-time pressure error estimate is provided with an analytic proof. In our error analysis, we do not use Grönwall’s inequality, so t...
متن کاملRobust multilevel methods for quadratic finite element anisotropic elliptic problems
This paper discusses a class of multilevel preconditioners based on approximate block factorization for conforming finite element methods (FEM) employing quadratic trial and test functions. The main focus is on diffusion problems governed by a scalar elliptic partial differential equation (PDE) with a strongly anisotropic coefficient tensor. The proposed method provides a high robustness with r...
متن کاملFast Nested Dissection for Finite Element Meshes
We present a randomized O(n log logn) time algorithm for constructing a recursive separator decomposition for well-shaped meshes in two and three dimensions. Our algorithm takes O(n log logn) time while previous algorithms require Θ(n logn) time. It uses techniques from probability theory, computational geometry, and graph theory. The new algorithm has an application in the solution of sparse l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2015
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2014.12.008